YES 12.042 H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/empty.hs
H-Termination of the given Haskell-Program with start terms could successfully be proven:



↳ HASKELL
  ↳ IFR

mainModule Main
  ((shows :: Bool  ->  [Char]  ->  [Char]) :: Bool  ->  [Char]  ->  [Char])

module Main where
  import qualified Prelude


If Reductions:
The following If expression
if b then (showChar '(') . p . showChar ')' else p

is transformed to
showParen0 p True = (showChar '(') . p . showChar ')'
showParen0 p False = p



↳ HASKELL
  ↳ IFR
    ↳ HASKELL
      ↳ BR

mainModule Main
  ((shows :: Bool  ->  [Char]  ->  [Char]) :: Bool  ->  [Char]  ->  [Char])

module Main where
  import qualified Prelude


Replaced joker patterns by fresh variables and removed binding patterns.

↳ HASKELL
  ↳ IFR
    ↳ HASKELL
      ↳ BR
        ↳ HASKELL
          ↳ COR

mainModule Main
  ((shows :: Bool  ->  [Char]  ->  [Char]) :: Bool  ->  [Char]  ->  [Char])

module Main where
  import qualified Prelude


Cond Reductions:
The following Function with conditions
undefined 
 | False
 = undefined

is transformed to
undefined  = undefined1

undefined0 True = undefined

undefined1  = undefined0 False



↳ HASKELL
  ↳ IFR
    ↳ HASKELL
      ↳ BR
        ↳ HASKELL
          ↳ COR
            ↳ HASKELL
              ↳ NumRed

mainModule Main
  ((shows :: Bool  ->  [Char]  ->  [Char]) :: Bool  ->  [Char]  ->  [Char])

module Main where
  import qualified Prelude


Num Reduction: All numbers are transformed to thier corresponding representation with Pos, Neg, Succ and Zero.

↳ HASKELL
  ↳ IFR
    ↳ HASKELL
      ↳ BR
        ↳ HASKELL
          ↳ COR
            ↳ HASKELL
              ↳ NumRed
                ↳ HASKELL
                  ↳ Narrow

mainModule Main
  (shows :: Bool  ->  [Char]  ->  [Char])

module Main where
  import qualified Prelude


Haskell To QDPs


↳ HASKELL
  ↳ IFR
    ↳ HASKELL
      ↳ BR
        ↳ HASKELL
          ↳ COR
            ↳ HASKELL
              ↳ NumRed
                ↳ HASKELL
                  ↳ Narrow
                    ↳ QDP
                      ↳ QDPSizeChangeProof

Q DP problem:
The TRS P consists of the following rules:

new_psPs(:(vx470, vx471), vx49) → new_psPs(vx471, vx49)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs: